R70-18 Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
نویسنده
چکیده
منابع مشابه
Transductions Computed by One-Dimensional Cellular Automata
Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the output. Since there is a particular interest in fast transductions, we mainly focus on the time complexities real time and linear time. We first ...
متن کاملFast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity
A d-dimensional cellular automaton with sequential input mode is a d-dimensional grid of interconnected interacting finite automata. The distinguished automaton at the origin, the communication cell, is connected to the outside world and fetches the input sequentially. Often in the literature this model is referred to as iterative array. We investigate d-dimensional iterative arrays and one-dim...
متن کاملA New Subdomain Method for Performances Computation in Interior Permanent-Magnet (IPM) Machines
In this research work, an improved two-dimensional semi-analytical subdomain based method for performance computation in IPM machine considering infinite-/finite-magnetic material permeability in pseudo-Cartesian coordinates by using hyperbolic functions has been presented. In the developed technique, all subdomains are divided into periodic or non-periodic regions with homogeneous or non-homog...
متن کاملA Closed-Form Solution for Two-Dimensional Diffusion Equation Using Crank-Nicolson Finite Difference Method
In this paper a finite difference method for solving 2-dimensional diffusion equation is presented. The method employs Crank-Nicolson scheme to improve finite difference formulation and its convergence and stability. The obtained solution will be a recursive formula in each step of which a system of linear equations should be solved. Given the specific form of obtained matrices, rather than sol...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 19 شماره
صفحات -
تاریخ انتشار 1970